An Enhanced Density and Grid based Spatial Clustering Algorithm for Large Spatial Database

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ADCA: Advanced Density Based Clustering Algorithm for Spatial Database System

Cluster detection in Spatial Databases is an important task for discovery of knowledge in spatial databases and in this domain density based clustering algorithms are very effective. Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm effectively manages to detect clusters of arbitrary shape with noise, but it fails in detecting local clusters as well as clusters of d...

متن کامل

VSCAN: An Enhanced Video Summarization Using Density-Based Spatial Clustering

In this paper, we present VSCAN, a novel approach for generating static video summaries. This approach is based on a modified DBSCAN clustering algorithm to summarize the video content utilizing both color and texture features of the video frames. The paper also introduces an enhanced evaluation method that depends on color and texture features. Video Summaries generated by VSCAN are compared w...

متن کامل

PFDC: A Parallel Algorithm for Fast Density-based Clustering in Large Spatial Databases

Clustering – the grouping of objects depending on their spatial proximity – is one important technique of knowledge discovery in spatial databases. One of the proposed algorithms for this is FDC [5], which uses a density-based clustering approach. Since there is a need for parallel processing in very large databases to distribute resource allocation, this paper presents PFDC, a parallel version...

متن کامل

EDACluster: An Evolucionary Density and Grid-Based Clustering Algorithm

This paper presents EDACluster, an Estimation of Distribution Algorithm (EDA) applied to the clustering task. EDA is an Evolutionary Algorithm used here to optimize the search for adequate clusters when very little is known about the target dataset. The proposed algorithm uses a mixed approach – density and grid-based – to identify sets of dense cells in the dataset. The output is a list of ite...

متن کامل

A grid-growing clustering algorithm for geo-spatial data

Geo-spatial data with geographical information explodes as the development of GPS-devices. The data contains certain patterns of users. To dig out the patterns behind the data efficiently, a grid-growing clustering algorithm is introduced. The proposed algorithm takes use of a grid structure, and a novel clustering operation is presented, which considers a grid growing method on the grid struct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The KIPS Transactions:PartD

سال: 2006

ISSN: 1598-2866

DOI: 10.3745/kipstd.2006.13d.5.633